Basic polymorphic typechecking
نویسندگان
چکیده
منابع مشابه
Basic Polymorphic Typechecking
Introduction Polymorphic means to have many forms. As related to programming languages, it refers to data or programs which have many types, or which operate on many types. There are several arbitrary ways in which programs can have many types; we are mostly interested in a particularly orderly form of polymorphism called parametric polymorphism. This is a property of programs which are paramet...
متن کاملXML Typechecking
SYNONYMS None DEFINITION In general, typechecking refers to the problem where, given a program P , an input type σ, and an output type τ , one must decide whether P is type-safe, that is, whether it produces only outputs of type τ when run on inputs of type σ. In the XML context, typechecking problems mainly arise in two forms: • • XML-to-XML transformations, where P transforms XML documents co...
متن کاملTypechecking Z
This paper presents some of our requirements for a Z type-checker: that the typechecker accept all well-typeable formulations, however contrived; that it gather information about uses of declarations as needed to support interactive browsing and formal reasoning; that it t the description given by draft standard Z; and that it be able to check some particular extensions to Z that are intended t...
متن کاملOn Typechecking B
The typechecking system of the formal method B is discussed. An inconsistency in the public definition of the B method, attributable to a flaw in the typechecking system, is uncovered: the typechecking method expects the types of variables to be given in one membership predicate, such as a, b, c ∈ A × B × C, instead of with several membership predicates joined by conjunction, like a ∈ A∧b ∈ B∧c...
متن کاملTypechecking Polymorphism in Emerald
Emerald is a statically typed object-oriented language that was originally intended for programming distributed subsystems and applications [Jul 88]. It is important that such systems be dynamically extensible, i.e., that it be possible to introduce new kinds of entities into the system without re-compiling or re-linking the whole system. This led us to devise a type system based on the notion ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1987
ISSN: 0167-6423
DOI: 10.1016/0167-6423(87)90019-0